On the spectrum in max algebra

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Some Properties of the Max Algebra System Over Tensors

Recently we generalized the max algebra system to the class of nonnegative  tensors. In this paper we give some basic properties for the left (right) inverse, under the new system. The existence of order 2 left (right) inverse of tensors is characterized. Also we generalize the direct product of matrices to the direct product of tensors (of the same order, but may be different dimensions) and i...

متن کامل

On the Power Method in Max Algebra

The eigenvalue problem for an irreducible nonnegative matrix A = a ij ] in the max algebra system is A x = x, where (A x) i = max j (a ij x j) and turns out to be the maximum circuit geometric mean, (A). A power method algorithm is given to compute (A) and eigenvector x. This method generalizes and simpliies an algorithm due to Braker and Olsder. The algorithm is developed by using results on t...

متن کامل

On the Combinatorial Aspects of Max–Algebra

Let a ⊕ b = max(a, b), a ⊗ b = a + b for a, b ∈ R := R ∪ {−∞}. By max-algebra we understand the analogue of linear algebra developed for the pair of operations (⊕,⊗) extended to matrices and vectors. Max-algebra, which has been studied for more than 40 years, is an attractive way of describing a class of nonlinear problems appearing for instance in machine-scheduling, information technology and...

متن کامل

Max-Plus algebra on tensors and its properties

In this paper we generalize the max plus algebra system of real matrices to the class of real tensors and derive its fundamental properties. Also we give some basic properties for the left (right) inverse, under the new system. The existence of order 2 left (right) inverses of tensors is characterized.

متن کامل

On matrix powers in max-algebra

Let A = (aij ) ∈ Rn×n,N = {1, . . . , n} and DA be the digraph (N, {(i, j); aij > −∞}). The matrix A is called irreducible if DA is strongly connected, and strongly irreducible if every maxalgebraic power of A is irreducible. A is called robust if for every x with at least one finite component, A(k) ⊗ x is an eigenvector of A for some natural number k. We study the eigenvalue–eigenvector proble...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2015

ISSN: 0024-3795

DOI: 10.1016/j.laa.2015.07.013